Defense Against Protocol Level Attack in Tor Network using Deficit Round Robin Queuing Process
نویسندگان
چکیده
منابع مشابه
Efficient Fair Queuing using Deficit Round Robin
Fair queuing is a technique that allows each flow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: specifically, the work required to process a packet in these schemes was O(log(n) ), where n is the number of active flows. This is expensive at high speeds. On the other...
متن کاملEecient Fair Queuing Using Deecit round Robin
Fair queuing is a technique that allows each ow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: speciically, the work required to process a packet in these schemes was O(log(n)), where n is the number of active ows. This is expensive at high speeds. On the other hand,...
متن کاملImplicit Service Differentiation using Deficit Round Robin
This paper describes and evaluates the performance of a modified deficit round robin scheduler called PDRR (for Priority DRR). In conjunction with per-flow admission control, PDRR allows the realization of implicit service differentiation where streaming and elastic flows are assured adequate performance without the need for explicit class of service marking or resource reservation. We show thr...
متن کاملProtocol-level attacks against Tor
Tor is a real-world, circuit-based low-latency anonymous communication network, supporting TCP applications over the Internet. In this paper, we present an extensive study of protocol-level attacks against Tor. Different from existing attacks, the attacks investigated in this paper can confirm anonymous communication relationships quickly and accurately by manipulating one single cell and pose ...
متن کاملEcient F Air Queuing Using Decit round Robin
Fair queuing is a technique that allows each ow passing through a network device to have a fair share of network resources. Previous schemes for fair queuing that achieved nearly perfect fairness were expensive to implement: speci cally, the work required to process a packet in these schemes was O(log(n)), where n is the number of active ows. This is expensive at high speeds. On the other hand,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Egyptian Informatics Journal
سال: 2018
ISSN: 1110-8665
DOI: 10.1016/j.eij.2018.03.005